Efficient massively parallel implementation of some combinatorial algorithms
نویسندگان
چکیده
منابع مشابه
cient Massively Parallel Implementation of Some Combinatorial Algorithms 1
We describe our implementation of several e cient parallel algorithms on the massively parallel SIMD machine MasPar MP-1 with virtual processing. The MPL language that we used on the MasPar MP-1 does not support virtual processing. In this paper, we describe the implementation of virtual processing for several combinatorial algorithms using the MPL language. We present our data allocation schem...
متن کاملEecient Massively Parallel Implementation of Some Combinatorial Algorithms 1
We describe our implementation of several eecient parallel algorithms on the massively parallel SIMD machine MasPar MP-1 with virtual processing. The MPL language that we used on the MasPar MP-1 does not support virtual processing. In this paper, we describe the implementation of virtual processing for several combi-natorial algorithms using the MPL language. We present our data allocation sche...
متن کاملEfficient Implementation of Nonlinear Compact Schemes on Massively Parallel Platforms
Weighted nonlinear compact schemes are ideal for simulating compressible, turbulent flows because of their nonoscillatory nature and high spectral resolution. However, they require the solution to banded systems of equations at each time-integration step or stage. We focus on tridiagonal compact schemes in this paper. We propose an efficient implementation of such schemes on massively parallel ...
متن کاملMassively Parallel Genetic Algorithms
Heuristic algorithms are usually employed to find an optimal solution to NP-Complete problems. Genetic algorithms are among such algorithms and they are search algorithms based on the mechanics of natural selection and genetics. Since genetic algorithms work with a set of candidate solutions, parallelisation based on the SIMD paradigm seems to be the natural way to obtain a speed up. In this ap...
متن کاملMassively Parallel Genetic Algorithms
The genetic algorithm is an iterative random search technique for nonlinear or combi-natorial problems. In this contribution, rst the development from the classical genetic algorithm (GA) via the parallel genetic algorithm (PGA) to the massively parallel genetic algorithm (MPGA) is described. Then experimental results with an implementation of the MPGA on the array processor MasPar MP-1 are dis...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1996
ISSN: 0304-3975
DOI: 10.1016/0304-3975(96)00034-5